Analytic colorings
نویسندگان
چکیده
We investigate the existence of perfect homogeneous sets for analytic colorings. An analytic coloring of X is an analytic subset of [X] , where N > 1 is a natural number. We define an absolute rank function on trees representing analytic colorings, which gives an upper bound for possible cardinalities of homogeneous sets and which decides whether there exists a perfect homogeneous set. We construct universal σ-compact colorings of any prescribed rank γ < ω1. These colorings consistently contain homogeneous sets of cardinality אγ but they do not contain perfect homogeneous sets. As an application, we discuss the so-called defectedness coloring of subsets of Polish linear spaces. 2000 Mathematics Subject Classification: Primary: 03E05, 03E15. Secondary: 03E35,
منابع مشابه
Measurable 3-colorings of Acyclic Graphs
This is the first of two lectures on measurable chromatic numbers given in June 2010 at the University of Barcelona. Our main result here is that acyclic locally finite analytic graphs on Polish spaces admit Baire measurable 3-colorings.
متن کاملBaire-class ξ colorings: the first three levels
The G0-dichotomy due to Kechris, Solecki and Todorčević characterizes the analytic relations having a Borel-measurable countable coloring. We give a version of the G0-dichotomy for Σ 0 ξ-measurable countable colorings when ξ ≤ 3. A Σ 0 ξ-measurable countable coloring gives a covering of the diagonal consisting of countably many Σξ squares. This leads to the study of countable unions of Σξ recta...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملA Combinatorial Proof of Sun's \Curious" Identity
A binomial coeÆcient identity due to Zhi-Wei Sun is the subject of half a dozen recent papers that prove it by various analytic techniques and establish a generalization. Here we give a simple proof that uses weight-reversing involutions on suitable con gurations involving dominos and colorings. With somewhat more work, the method extends to the generalization also. 0 Introduction The identity
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 121 شماره
صفحات -
تاریخ انتشار 2003